A Novel Quantum Immune Algorithm for Multiobjective Flexible Job Shop Scheduling

In this study, a hybrid of Quantum Evolutionary and Artificial Immune Algorithms (QIA) is proposed for solving Multiobjective Flexible Job Shop Scheduling Problem (MFJSSP). This problem is formulated as a three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. The quantum coding is shown to improve the immune strategy. The proposed algorithm overcomes the problem by increasing the speed of convergence and diversity of population. Three benchmarks of Kacem and Brandimart are examined to evaluate the performance of the proposed algorithm. The experimental results show a better performance in comparison to other approaches.